Quadratic Gröbner bases arising from partially ordered sets
نویسندگان
چکیده
منابع مشابه
Quadratic Gröbner Bases Arising from Partially Ordered Sets
The order polytope O(P ) and the chain polytope C(P ) associated to a partially ordered set P are studied. In this paper, we introduce the convex polytope Γ(O(P ),−C(Q)) which is the convex hull of O(P ) ∪ (−C(Q)), where both P and Q are partially ordered sets with |P | = |Q| = d. It will be shown that Γ(O(P ),−C(Q)) is a normal and Gorenstein Fano polytope by using the theory of reverse lexico...
متن کاملTripled partially ordered sets
In this paper, we introduce tripled partially ordered sets and monotone functions on tripled partiallyordered sets. Some basic properties on these new dened sets are studied and some examples forclarifying are given.
متن کاملSmooth Fano Polytopes Arising from Finite Partially Ordered Sets
Gorenstein Fano polytopes arising from finite partially ordered sets will be introduced. Then we study the problem which partially ordered sets yield smooth Fano polytopes. Introduction An integral (or lattice) polytope is a convex polytope all of whose vertices have integer coordinates. Let P ⊂ R be an integral convex polytope of dimension d. • We say that P is a Fano polytope if the origin of...
متن کاملMTL-algebras arising from partially ordered groups
After dropping the implication-like operation and reversing the order, an MTL-algebra becomes a partially ordered structure (L;≤,⊕, 0, 1) based on the single addition-like operation ⊕. Furthermore, ⊕ may be restricted to a partial, but cancellative addition + without loss of information. We deal in this paper with the case that the resulting partial algebra (L;≤,+, 0, 1) is embeddable into the ...
متن کاملBinomial Edge Ideals with Quadratic Gröbner Bases
We prove that a binomial edge ideal of a graph G has a quadratic Gröbner basis with respect to some term order if and only if the graph G is closed with respect to a given labelling of the vertices. We also state some criteria for the closedness of a graph G that do not depend on the labelling of its vertex set.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: MATHEMATICA SCANDINAVICA
سال: 2017
ISSN: 1903-1807,0025-5521
DOI: 10.7146/math.scand.a-26246